Fault-Tolerant Business Processes

Abstract. Service-oriented computing (SOC) paradigm promotes the idea of assembling application components into a network of loosely coupled services. Web services are the most promising SOC-based technology. A BPEL process definition represents a composite service that encapsulates some complex business logic including the invocation to other (external) web services. The complexity of a BPEL process together with the invocation of external services subject to network and computer failures requires countermeasures to tolerate this kind of failures. In this paper we present an overview of FT-BPEL, a fault-tolerant implementation of BPEL that copes both with failures of the machine running the BPEL process and network failures in a transparent way, that is, after a failure the system is able to resume the BPEL process consistently

The first report of Candida dubliniensis from human root caries lesions

published_or_final_versio

The microflora of root surface caries in Southern Chinese

published_or_final_versio

In vitro growth, acidogenicity and cariogenicity of predominant bacteria in root caries

published_or_final_versio

Revolutionary development of computer education : A success story

The University of Colombo, Sri Lanka has been in the forefront of the “Computer Revolution” in Sri Lanka. It has introduced the teaching of computer programming and applications as early as in 1967, more than a decade before other educational institutions, thereby producing, over the years, a large number of pioneer computer scientists and IT graduates out of students entering the university from a variety of disciplines. They are presently employed as researchers, educators, data processing managers, analyst programmers, software engineers and in many others in the professional field of information technology, not only in Sri Lanka but also in other countries. Established in 1870 as the Ceylon Medical College by the government of that day under the leadership of Governor Sir Hercules Robinson, the University of Colombo could claim to have been associated with higher education for over 130 years. The University has become a center of excellence of international repute that contributes significantly towards national development and human resource development in the field on computer science and information communication technology, particularly in the South and South East Asian Region. This paper presents the milestones of the success story, which did not occur without a policy, plan, leadership, group work, collaboration, and donor support.2nd IFIP Conference on the History of Computing and EducationRed de Universidades con Carreras en Informática (RedUNCI

Candidal adherence to cultured human cells of varying origin

published_or_final_versio

Host-microbial interactions in health and disease

published_or_final_versio

In pursuit of the ideal antifungal agent for Candida infections: high-throughput screening of small molecules

Candida infections have created a great burden on the public healthcare sector. The situation is worsened by recent epidemiological changes. Furthermore, the current arsenal of antifungal agents is limited and associated with undesirable drawbacks. Therefore, new antifungal agents that surpass the existing ones are urgently needed. High-throughput screening of small molecule libraries enables rapid hit identification and, possibly, increases hit rate. Moreover, the identified hits could be associated with unrecognized or multiple drug targets, which would provide novel insights into the biological processes of the pathogen. Hence, it is proposed that high-throughput screening of small molecules is particularly important in the pursuit of the ideal antifungal agents for Candida infections

Fungicidal activity of Histain-5 against Candida species

published_or_final_versio

Tractable Pathfinding for the Stochastic On-Time Arrival Problem

We present a new and more efficient technique for computing the route that maximizes the probability of on-time arrival in stochastic networks, also known as the path-based stochastic on-time arrival (SOTA) problem. Our primary contribution is a pathfinding algorithm that uses the solution to the policy-based SOTA problem---which is of pseudo-polynomial-time complexity in the time budget of the journey---as a search heuristic for the optimal path. In particular, we show that this heuristic can be exceptionally efficient in practice, effectively making it possible to solve the path-based SOTA problem as quickly as the policy-based SOTA problem. Our secondary contribution is the extension of policy-based preprocessing to path-based preprocessing for the SOTA problem. In the process, we also introduce Arc-Potentials, a more efficient generalization of Stochastic Arc-Flags that can be used for both policy- and path-based SOTA. After developing the pathfinding and preprocessing algorithms, we evaluate their performance on two different real-world networks. To the best of our knowledge, these techniques provide the most efficient computation strategy for the path-based SOTA problem for general probability distributions, both with and without preprocessing.Comment: Submission accepted by the International Symposium on Experimental Algorithms 2016 and published by Springer in the Lecture Notes in Computer Science series on June 1, 2016. Includes typographical corrections and modifications to pre-processing made after the initial submission to SODA'15 (July 7, 2014